Adaptive dropout for high-dimensional expensive multiobjective optimization
نویسندگان
چکیده
Abstract Various works have been proposed to solve expensive multiobjective optimization problems (EMOPs) using surrogate-assisted evolutionary algorithms (SAEAs) in recent decades. However, most existing methods focus on EMOPs with less than 30 decision variables, since a large number of training samples are required build an accurate surrogate model for high-dimensional EMOPs, which is unrealistic optimization. To address this issue, we propose SAEA adaptive dropout mechanism. Specifically, mechanism takes advantage the statistical differences between different solution sets space guide selection some crucial variables. A new infill criterion then optimize selected variables assistance models. Moreover, optimized extended full-length solutions, and candidate solutions evaluated functions update archive. The algorithm tested benchmark up 200 compared state-of-the-art SAEAs. experimental results demonstrated promising performance computational efficiency
منابع مشابه
High Dimensional Bayesian Optimization using Dropout
Scaling Bayesian optimization to high dimensions is challenging task as the global optimization of high-dimensional acquisition function can be expensive and often infeasible. Existing methods depend either on limited “active” variables or the additive form of the objective function. We propose a new method for high-dimensional Bayesian optimization, that uses a dropout strategy to optimize onl...
متن کاملMultiobjective optimization of expensive-to-evaluate deterministic computer simulator models
Many engineering design optimization problems containmultiple objective functions all of which are desired to be minimized, say. This paper proposes a method for identifying the Pareto Front and the Pareto Set of the objective functions when these functions are evaluated by expensive-to-evaluate deterministic computer simulators. The method replaces the expensive function evaluations by a rapid...
متن کاملExpensive Multiobjective Optimization and Validation with a Robotics Application
Many practical optimization problems, especially in robotics, involve multiple competing objectives, e.g. performance metrics such as speed and energy efficiency. Proper treatment of these objective functions is often overlooked. Additionally, optimization of the performance of robotic systems can be restricted due to the expensive nature of testing control parameters on a physical system. This...
متن کاملAsymmetric Pareto-adaptive Scheme for Multiobjective Optimization
A core challenge ofMultiobjective Evolutionary Algorithms (MOEAs) is to attain evenly distributed Pareto optimal solutions along the Pareto front. In this paper, we propose a novel asymmetric Pareto-adaptive (apa) scheme for the identification of well distributed Pareto optimal solutions based on the geometrical characteristics of the Pareto front. The apa scheme applies to problem with symmetr...
متن کاملAdaptive Weighted Sum Method for Multiobjective Optimization
This paper presents an adaptive weighted sum method for multiobjective optimization problems. The authors developed the bi-objective adaptive weighted sum method, which determines uniformly-spaced Pareto optimal solutions, finds solutions on non-convex regions, and neglects non-Pareto optimal solutions. However, the method could solve only problems with two objective functions. In this work, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2021
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-021-00362-5